On Minimal Energy Skew Routing in Lossy Wireless Sensor Networks
نویسندگان
چکیده
For several sensor networks applications, it is critical to extend the lifetime of each individual sensor node in order to remain operational for the longest time possible. Therefore, the power consumption rate should be evenly distributed over all the nodes in the system. Traditional routing algorithms attempt to minimize the total power consumption of the system, but they do not attempt to evenly distribute the load over all the nodes in the network. In this paper, we present an efficient routing algorithm that minimizes the energy skew among nodes in a network with lossy links. We propose an ε-optimal polynomial time centralized multi-hop routing technique that maximizes the lifetime a system of distributed power sources, considering the quality of the wireless links and the vagaries of the radio communication channel. Our technique aims to evenly distribute the power consumption rate which yields in a minimal-skew solution. We theoretically prove that our technique is efficient. Finally, we illustrate the quality of the solutions provided by our algorithms on a set of benchmarks that consider the quality of the wireless channels based on models using real RF transcievers. We show that our solution provides significant increase in the lifetime of the network (up to five times) at the cost of a slight increase in the latency of the end-to-end paths (up to 10%).
منابع مشابه
Improving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks
Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملRAWSN: A Routing Algorithm Based on Auxiliary Nodes to Reduce Energy Consumption in Wireless Sensor Networks
In this paper, an algorithm , based on genetics and auxiliary nodes, to reduce energy consumption in wireless sensor networks has been presented. In this research, by considering some parameters as energy and distance, a target function has been created, which is more optimum comparing to other methods. In this research cluster head is selected by genetic algorithm. In RAWSN algorithm a new tec...
متن کاملA JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملMLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks
Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....
متن کامل